The Complexity of Valued CSPs
نویسندگان
چکیده
We survey recent results on the broad family of problems that can be cast as valued constraint satisfaction problems (VCSPs). We discuss general methods for analysing the complexity of such problems, give examples of tractable cases, and identify general features of the complexity landscape. 1998 ACM Subject Classification F.1.3 Complexity Measures and Classes, G.1.6 Optimization
منابع مشابه
Structural Symmetry Breaking
Symmetry breaking has been shown to be an important method to speed up the search in constraint satisfaction problems that contain symmetry. When breaking symmetry by dominance detection, a computationally efficient symmetry breaking scheme can be achieved if we can solve the dominance detection problem in polynomial time. We study the complexity of dominance detection when value and variable s...
متن کاملThe Power of Sherali-Adams Relaxations for General-Valued CSPs
We give a precise algebraic characterisation of the power of Sherali-Adams relaxations for solvability of valued constraint satisfaction problems to optimality. The condition is that of bounded width which has already been shown to capture the power of local consistency methods for decision CSPs and the power of semidefinite programming for robust approximation of CSPs. Our characterisation has...
متن کاملThe complexity of general-valued CSPs seen from the other side
General-valued constraint satisfaction problems (VCSPs) are generalisations of CSPs dealing with homomorphisms between two valued structures. We study the complexity of structural restrictions for VCSPs, that is, restrictions defined by classes of admissible lefthand side valued structures. As our main result, we show that for VCSPs of bounded arity the only tractable structural restrictions ar...
متن کاملBinarisation for Valued Constraint Satisfaction Problems
We study methods for transforming valued constraint satisfaction problems (VCSPs) to binary VCSPs. First, we show that the standard dual encoding preserves many aspects of the algebraic properties that capture the computational complexity of VCSPs. Second, we extend the reduction of CSPs to binary CSPs described by Bulín et al. [LMCS’15] to VCSPs. This reduction establishes that VCSPs over a fi...
متن کاملThe Complexity of Boolean Surjective General-Valued CSPs
Valued constraint satisfaction problems (VCSPs) are discrete optimisation problems with a Q-valued objective function given as a sum of fixed-arity functions, where Q = Q ∪ {∞} is the set of extended rationals. In Boolean surjective VCSPs variables take on labels from D = {0, 1} and an optimal assignment is required to use both labels from D. A classic example is the global mincut problem in gr...
متن کاملOn Planar Valued CSPs
We study the computational complexity of planar valued constraint satisfaction problems (VCSPs). First, we show that intractable Boolean VCSPs have to be self-complementary to be tractable in the planar setting, thus extending a corresponding result of Dvořák and Kupec [ICALP’15] from CSPs to VCSPs. Second, we give a complete complexity classification of conservative planar VCSPs on arbitrary f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017